Approximating minimum cost source location problems with local vertex-connectivity demands
نویسندگان
چکیده
منابع مشابه
Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
The source location problem is a problem of computing a minimum cost source set in an undirected graph so that the connectivity between the source set and a vertex is at least the demand of the vertex. In this paper, the connectivity between a source set S and a vertex v is defined as the maximum number of paths between v and S no two of which have common vertex except v. We propose an O(d∗ log...
متن کاملApproximating minimum cost connectivity problems
We survey approximation algorithms and hardness results for versions of the Generalized Steiner Network (GSN) problem in which we seek to find a low cost subgraph (where the cost of a subgraph is the sum of the costs of its edges) that satisfies prescribed connectivity requirements. These problems include the following well known problems: min-cost k-flow, min-cost spanning tree, traveling sale...
متن کاملMinimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements
Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has a demand d(v) ∈ Z+ and a cost c(v) ∈ R+, where Z+ and R+ denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices minimizing ∑ v∈S c(v) ...
متن کاملSource location problems considering vertex-connectivity and edge-connectivity simultaneously
Let G (V, E) be an undirected multigraph, where V and E are a set of vertices and a set of edges, respectively. Let k and l be fixed nonnegative integers. This paper considers location problems of finding a minimum-size vertex-subset S V such that for each vertex x V the vertex-connectivity between S and x is greater than or equal to k and the edge-connectivity between S and x is greater than o...
متن کاملThe source location problem with local 3-vertex-connectivity requirements
Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has an integer valued demand d(v) ≥ 0. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices with the minimum cardinality such that there are at least d(v) vertex disjoint paths between S and each vertex v ∈ V − S. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2013
ISSN: 1570-8667
DOI: 10.1016/j.jda.2013.02.002